On the Direct Sum Conjecture in the Straight Line Model
نویسنده
چکیده
We prove that if a quadratic system satisses the direct sum conjecture strongly in the quadratic algorithm model, then it satisses the direct sum conjecture strongly in the straight line algorithm model. Therefore, if the strong direct sum conjecture is true for the quadratic algorithm model then it is also true for the straight line algorithm model. We use this to classify all the minimal programs that compute the product of two polynomials modulo a squarfree polynomial.
منابع مشابه
OPTIMAL NOZZLE SHAPES OF CO2-N2-H2O GASDYNAMIC LASERS
In an axisymmetric CO2-N2-H2O gas dynamic laser, let ? denote the intersection of the vertical plane of symmetry with the upper part of the (supersonic) nozzle. To obtain a maximal small signal gain, some authors have tested several families of curves for ?. To find the most general solution for ?, an application of Pontryagin’s principle led to the conjuncture that the optimal ? must consist o...
متن کاملUpper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملHierarchy Style Application in Line Extension with Responsive Loads Evaluating the Dynamic Nature of Solar Units
This paper presents a model for line extension scheduled to participate in responsive loads in the power system aiming the improvement of techno-economical parameters. The model is studied with the presence of photovoltaic generators that produce variable power depending on the geographical condition. The investment cost of the transmission expansion plan, demand response operation cost, genera...
متن کاملThe Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract)
Efficient Self Simulation Algorithms for Reconfigurable Arrays p. 25 Optimal Upward Planarity Testing of Single-Source Digraphs p. 37 On Bufferless Routing of Variable-Length Messages in Leveled Networks p. 49 Saving Comparisons in the Crochemore-Perrin String Matching Algorithm p. 61 Unambiguity of Extended Regular Expressions in SGML Document Grammars p. 73 On the Direct Sum Conjecture in the...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 14 شماره
صفحات -
تاریخ انتشار 1993